Topology-preserving hexagonal thinning

نویسندگان

  • Péter Kardos
  • Kálmán Palágyi
چکیده

Thinning is awell-known technique for producing skeleton-like shape features fromdigital binary objects in a topology-preserving way.Most of the existing thinning algorithms work on input images that are sampled on orthogonal grids; however, it is also possible to perform thinning on hexagonal grids (or triangular lattices). In this paper, we point out to the main similarities and differences between the topological properties of these two types of sampling schemes.We give various characterizations of simple points and present some new sufficient conditions for topology-preserving reductions working on hexagonal grids.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hexagonal parallel thinning algorithms based on sufficient conditions for topology preservation

Thinning is a well-known technique for producing skeleton-like shape features from digital binary objects in a topology preserving way. Most of the existing thinning algorithms presuppose that the input images are sampled on orthogonal grids. This paper presents new sufficient conditions for topology preserving reductions working on hexagonal grids (or triangular lattices) and eight new 2D hexa...

متن کامل

On Topology Preservation for Hexagonal Parallel Thinning Algorithms

Topology preservation is the key concept in parallel thinning algorithms on any sampling schemes. This paper establishes some sufficient conditions for parallel thinning algorithms working on hexagonal grids (or triangular lattices) to preserve topology. By these results, various thinning (and shrinking to a residue) algorithms can be verified. To illustrate the usefulness of our sufficient con...

متن کامل

On Topology Preservation for Triangular Thinning Algorithms

Thinning is a frequently used strategy to produce skeletonlike shape features of binary objects. One of the main problems of parallel thinning is to ensure topology preservation. Solutions to this problem have been already given for the case of orthogonal and hexagonal grids. This work introduces some characterizations of simple pixels and some sufficient conditions for parallel thinning algori...

متن کامل

Topology Preserving Parallel 3D Thinning Algorithms

A widely used technique to obtain skeletons of binary objects is thinning, which is an iterative layer-by-layer erosion in a topology preserving way. Thinning in 3D is capable of extracting various skeleton-like shape descriptors (i.e., centerlines, medial surfaces, and topological kernels). This chapter describes a family of new parallel 3D thinning algorithms for (26,6) binary pictures. The r...

متن کامل

2D Parallel Thinning and Shrinking Based on Sufficient Conditions for Topology Preservation

Thinning and shrinking algorithms, respectively, are capable of extracting medial lines and topological kernels from digital binary objects in a topology preserving way. These topological algorithms are composed of reduction operations: object points that satisfy some topological and geometrical constraints are removed until stability is reached. In this work we present some new sufficient cond...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Comput. Math.

دوره 90  شماره 

صفحات  -

تاریخ انتشار 2013